Parallel Text Searching on a Beowulf Cluster using SRW
نویسندگان
چکیده
منابع مشابه
Parallel Data Mining on a Beowulf Cluster
This paper presents a parallel data mining application for predictive modelling running on a Beowulf style Linux cluster. Data mining or Knowledge Discovery in Databases (KDD) is the process of analysing large and complex data sets with the purpose of extracting useful and previously unknown knowledge. The task of predictive modelling is the prediction of an attribute according to a model built...
متن کاملParallel text searching applications on a heterogeneous cluster architecture
In this paper, we propose four text searching implementations on a cluster of heterogeneous workstations using MPI message passing library. The first three parallel implementations are based on the static and dynamic master-worker methods. Further, we propose a hybrid parallel implementation that combines the advantages of static and dynamic parallel methods in order to reduce the load imbalanc...
متن کاملParallel Text Searching Application on a Heterogeneous Cluster of Workstations
In this paper we propose a high-performance text searching implementation on a heterogeneous cluster of workstations using MPI message passing library. We test this parallel implementation and present experimental results for different text sizes and number of workstations. We also present a performance prediction model that agrees well with our experimental measurements.
متن کاملMultivariate Geographic Cluster Using a Beowulf-style Parallel Computer
The authors present an application of multivariate non-hierarchical statistical clustering to geographic environmental data from the 48 conterminous United States in order to produce maps of regions of ecological similarity called ecore-gions. Nine input variables thought to aflect the growth of vegetation are clustered at a resolution of one square kilometer. These data represent over 7.8 mill...
متن کاملA Parallel Learning Algorithm for Text Categorization on PIRUN Beowulf Cluster
Text categorization is the process of classifying documents into predefined categories or classes based on their content. Since text data rapidly increase on the Internet, the scalability of the algorithm is required to handle such massive data. In this paper, we propose a parallel learning algorithm for text categorization based on the combination of the Expectation-Maximization (EM) algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: D-Lib Magazine
سال: 2005
ISSN: 1082-9873
DOI: 10.1045/september2005-levan